Penalty Method for Variational Inequalities
نویسندگان
چکیده
منابع مشابه
Optimal Penalty-feti Method for Variational Inequalities
We shall first briefly review our results related to solving of the convex box constrained quadratic programming problems by combination of the active set strategy and the conjugate gradient method with projections [1]. In particular, we shall show that with proper modification of the proportioning algorithm with projection [2], it is possible give the rate of convergence in terms of the spectr...
متن کاملThe Penalty Method for a New System of Generalized Variational Inequalities
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We consider a new system of generalized variational inequalities SGVI. Using the penalty methods, we prove the existence of solution of SGVI in Hilbert spaces. Our results extend and improve some known results.
متن کاملImplicit Iterative Method for Hierarchical Variational Inequalities
1 Scientific Computing Key Laboratory of Shanghai Universities, Department of Mathematics, Shanghai Normal University, Shanghai 200234, China 2 Department of Mathematics, Aligarh Muslim University, Aligarh 202 002, India 3 Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia 4 Department of Applied Mathematics, National Sun Yat-se...
متن کاملA new iterative method for variational inequalities
It is well known that the variational inequalities are equivalent to the fixed point problems. Using this equivalence, we suggest and consider a new three-step iterative method for solving variational inequalities. The new iterative method is obtained by using three steps under suitable conditions. We prove that the new method is globally convergent. Our results can be viewed as significant ext...
متن کاملA Pivotal Method for Affine Variational Inequalities
We explain and justify a path-following algorithm for solving the equations Af^ix) = a, where A is a. linear transformation from R" to R", C is a polyhedral convex subset of R", and Ac is the associated normal map. When A^ is coherently oriented, we are able to prove that the path following method terminates at the unique solution of A^ix) = a, which is a generalization of the weU known fact th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 1997
ISSN: 0196-8858
DOI: 10.1006/aama.1996.0521